Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process

As an important part of the Internet of Things (IOT) and the special case of device-to-device (D2D) communication, wireless body area network (WBAN) gradually becomes the focus of attention. Since WBAN is a body-centered network, the energy of sensor nodes is strictly restrained since they are supplied by battery with limited power. In each data collection, only one sensor node is scheduled to transmit its measurements directly to the access point (AP) through the fading channel. We formulate the problem of dynamically choosing which sensor should communicate with the AP to maximize network lifetime under the constraint of fairness as a constrained markov decision process (CMDP). The optimal lifetime and optimal policy are obtained by Bellman equation in dynamic programming. The proposed algorithm defines the limiting performance in WBAN lifetime under different degrees of fairness constraints. Due to the defect of large implementation overhead in acquiring global channel state information (CSI), we put forward a distributed scheduling algorithm that adopts local CSI, which saves the network overhead and simplifies the algorithm. It was demonstrated via simulation that this scheduling algorithm can allocate time slot reasonably under different channel conditions to balance the performances of network lifetime and fairness

Finishing the euchromatic sequence of the human genome

The sequence of the human genome encodes the genetic instructions for human physiology, as well as rich information about human evolution. In 2001, the International Human Genome Sequencing Consortium reported a draft sequence of the euchromatic portion of the human genome. Since then, the international collaboration has worked to convert this draft into a genome sequence with high accuracy and nearly complete coverage. Here, we report the result of this finishing process. The current genome sequence (Build 35) contains 2.85 billion nucleotides interrupted by only 341 gaps. It covers ∼99% of the euchromatic genome and is accurate to an error rate of ∼1 event per 100,000 bases. Many of the remaining euchromatic gaps are associated with segmental duplications and will require focused work with new methods. The near-complete sequence, the first for a vertebrate, greatly improves the precision of biological analyses of the human genome including studies of gene number, birth and death. Notably, the human enome seems to encode only 20,000-25,000 protein-coding genes. The genome sequence reported here should serve as a firm foundation for biomedical research in the decades ahead

Communication-Efficient Federated Learning in Channel Constrained Internet of Things

Federated learning (FL) is able to utilize the computing capability and maintain the privacy of the end devices by collecting and aggregating the locally trained learning model parameters while keeping the local personal data. As the most widely-used FL framework,Jederated averaging (FedAvg) suffers an expensive communication cost especially when there are large amounts of devices involving the FL process. Moreover, when considering asynchronous FL, the slowest device becomes the bottleneck for the cask effect and determines the overall latency. In this work, we propose a communication-efficient federated learning framework with partial model aggregation (CE-FedPA) algorithm to utilize compression strategy and weighted device selection, which can significantly reduce the size of uploaded data and decrease the communication time. We perform a series of experiments on the MNIST/CIFAR-10 datasets, in both lID and non-lID data settings. We compare the communication time of different aggregation schemes, in terms of iteration rounds and target accuracy. Simulation results demonstrate that the uploading time of the proposed scheme is up to 4.3 times shorter than other existing ones. Experiments on an end - to-end FL framework also verify the communication efficiency of CE-FedPA in a real-world setting.peerReviewe